Hi, I am Sander Borst,

I am a mathematician working in theoretical computer science. I am fascinated by solving hard problems. In particular, I am interested in the design of online algorithms. Recently I have been working on:

• online network design
• online (hypergraph) matching
• online graph exploration

I also like software development and I have experience with a wide range of programming languages and techniques.

In September, I will be starting as a postdoc in the Algorithms and Complexity group of the Max Planck Institute for Informatics in Saarbrücken. Before, I have worked as a PhD candidate at the Centrum Wiskunde & Informatica in Amsterdam in the Networks & Optimization group, advised by Daniel Dadush.

I have bachelor’s degrees in mathematics and computer science and a master’s degree in mathematics from the Delft University of Technology.

For more information, see my cv.

Publications